A Quantum Algorithm for Evaluating the Hamming Distance

نویسندگان

چکیده

We present a novel quantum algorithm to evaluate the hamming distance between two unknown oracles via measuring degree of entanglement ancillary qubits. In particular, we use power based computing model that preserves at most locality interactions within structure. This uses one techniques retrieve solution problem hand. first technique, is obtained on whether there an qubits or not. second, as function in concurrence value, and number states can be generated from Boolean variables. The proposed receives oracles, each oracle represents function, then it measures these oracles. evaluated second technique. It shown provides exponential speedup compared with classical counterpart for functions have large numbers explained case study. Finally, employing recently developed experimental techniques, has been verified using IBM's computer simulator.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Block-Sensitivity Lower Bound for Quantum Testing Hamming Distance

The Gap-Hamming distance problem is the promise problem of deciding if the Hamming distance h between two strings of length n is greater than a or less than b, where the gap g = |a − b| ≥ 1 and a and b could depend on n. In this short note, we give a lower bound of Ω( √ n/g) on the quantum query complexity of computing the GapHamming distance between two given strings of lenght n. The proof is ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

A Novel Algorithm for Digital Distance Relaying

Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...

متن کامل

A Novel Algorithm for Digital Distance Relaying

Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...

متن کامل

Quantum Dot Structures Measuring Hamming Distance for Associative Memories

ABSTRACT This paper describes new quantum-dot circuits that measure a Hamming distance by using the Coulomb repulsion effect between quantum dots. Measuring similarity between patterns expressed by a Hamming distance is a basic function for various information processing. Quantum dot structures realizing these circuits are also proposed, which will be constructed by using the well-controlled na...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2022

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2022.020103